Grad and classes with bounded expansion I. Decompositions
نویسندگان
چکیده
We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). For these classes we prove the existence of several partition results such as the existence of low tree-width and low tree-depth colorings. This generalizes and simplifies several earlier results (obtained for minor closed classes).
منابع مشابه
Grad and classes with bounded expansion II. Algorithmic aspects
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). These classes are also characterized by the existence of several partition results such as the existence of low tree-width and low tree-depth colorings [19][18...
متن کاملGrad and classes with bounded expansion III. Restricted graph homomorphism dualities
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded degree graphs and also for proper minor closed classes. This is related to distance coloring of graphs and to the “approximative version” of Hadwiger conjecture.
متن کاملSmall graph classes and bounded expansion
A class of simple undirected graphs is small if it contains at most n!α labelled graphs with n vertices, for some constant α. We prove that for any constants c, ε > 0, the class of graphs with expansion bounded by the function f(r) = c 1/3−ε is small. Also, we show that the class of graphs with expansion bounded by 6 · 3 √ r log(r+e) is not small. We work with simple undirected graphs, without ...
متن کاملSublinear separators, fragility and subexponential expansion
Let G be a subgraph-closed graph class with bounded maximum degree. We show that if G has balanced separators whose size is smaller than linear by a polynomial factor, then G has subexponential expansion. This gives a partial converse to a result of Nešetřil and Ossona de Mendez. As an intermediate step, the proof uses a new kind of graph decompositions. The concept of graph classes with bounde...
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008